Uncertain Voronoi Diagram.dvi
نویسندگان
چکیده
In this paper, we introduce the fuzzy Voronoi diagram as an extension of the Voronoi diagram. We assume Voronoi sites to be fuzzy points and then define the Voronoi diagram for this kind of sites, then we provide an algorithm for computing this diagram based on Fortune’s algorithm which costs O(n log n) time. Also we introduce the fuzzy Voronoi diagram for a set of fuzzy circles, rather than fuzzy points, of the same radius. We prove that the boundary of this diagram is formed by the intersection of some hyperbolae, and finally we provide an O(n3 log n)-time algorithm to compute the boundary.
منابع مشابه
Unsupervised classification of uncertain data objects in spatial databases using computational geometry and indexing techniques
Unsupervised classification called clustering is a process of organizing objects into groups whose members are similar in some way. Clustering of uncertain data objects is a challenge in spatial data bases. In this paper we use Probability Density Functions (PDF) to represent these uncertain data objects, and apply Uncertain K-Means algorithm to generate the clusters. This clustering algorithm ...
متن کاملAn Approach for clustering uncertain data objects: A Survey
Recently, uncertain data objects is used in various applications such as VANET environment, sensors applications, image processing based system etc. Clustering of uncertain data is a major concept in data mining since more and more applications, such as sensor database, location database, biometric information systems, and produce vague and imprecise data. Clustering of uncertain data objects i...
متن کاملMulti-Robot Voronoi Coverage under Actuation and Measurement Noise
In this paper, we study the problem of multi-robot coverage when the evolution of the robots’ positions is uncertain. More precisely, we use the popular Voronoi coverage control approach [1], which is based on the iterative construction of a centroidal Voronoi tessellation, and ask what happens to the control law and the Voronoi tessellation under actuation and measurement noise. We present a f...
متن کاملUncertain Voronoi Cell Computation Based on Space Decomposition
The problem of computing Voronoi cells for spatial objects whose locations are not certain has been recently studied. In this work, we propose a new approach to compute Voronoi cells for the case of objects having rectangular uncertainty regions. Since exact computation of Voronoi cells is hard, we propose an approximate solution. The main idea of this solution is to apply hierarchical access m...
متن کاملApproximate UV computation based on space decomposition
Voronoi diagrams are commonly used to answer traditional nearestneighbor queries in spatial databases. In this work, we propose a new approach to compute Voronoi-cells for the case of uncertain objects having rectangular uncertainty regions. Since exact computation of Voronoi-cells is a hard problem, we instead propose an approximate solution. The main idea of this solution is to apply hierarch...
متن کامل